In the context of an efficient network traffic engineering process where the network continuously measures a new traffic matrix and updates the set of paths in the network, an automated process is required to quickly and efficiently identify when and what set of paths should be used. Unfortunately, the burden of finding the optimal solution for the network updating process in each given time interval is high since the computation complexity of optimization approaches using linear programming increases significantly as the size of the network increases. In this paper, we use deep reinforcement learning to derive a data-driven algorithm that does the path selection in the network considering the overhead of route computation and path updates. Our proposed scheme leverages information about past network behavior to identify a set of robust paths to be used for multiple future time intervals to avoid the overhead of updating the forwarding behavior of routers frequently. We compare the results of our approach to other traffic engineering solutions through extensive simulations across real network topologies. Our results demonstrate that our scheme fares well by a factor of 40% with respect to reducing link utilization compared to traditional TE schemes such as ECMP. Our scheme provides a slightly higher link utilization (around 25%) compared to schemes that only minimize link utilization and do not care about path updating overhead.

基于深度学习的脑磁共振成像（MRI）重建方法有可能加速MRI采集过程。尽管如此，科学界缺乏适当的基准，以评估高分辨率大脑图像的MRI重建质量，并评估这些所提出的算法在存在小而且预期的数据分布班次存在下的表现。多线圈磁共振图像（MC-MRI）重建挑战提供了一种基准，其目的在于使用高分辨率，三维，T1加权MRI扫描的大型数据集。挑战有两个主要目标：1）比较该数据集和2）上的不同的MRI重建模型，并评估这些模型的概括性，以通过不同数量的接收器线圈获取的数据。在本文中，我们描述了挑战实验设计，并总结了一系列基线和艺术脑MRI重建模型的结果。我们提供有关目前MRI重建最先进的相关比较信息，并突出挑战在更广泛的临床采用之前获得所需的普遍模型。 MC-MRI基准数据，评估代码和当前挑战排行榜可公开可用。它们为脑MRI重建领域的未来发展提供了客观性能评估。